Group Connectivity: $\mathbb Z_4$ v. $\mathbb Z_2^2$
نویسندگان
چکیده
We answer a question on group connectivity suggested by Jaeger et al. [Group connectivity of graphs – A nonhomogeneous analogue of nowhere-zero flow properties, JCTB 1992]: we find that Z2-connectivity does not imply Z4-connectivity, neither vice versa. We use a computer to find the graphs certifying this and to verify their properties using nontrivial enumerative algorithm. While the graphs are small (the largest has 15 vertices and 21 edges), a computer-free approach remains elusive.
منابع مشابه
Asymptotic bounds of depth for the reversible circuit consisting of NOT, CNOT and 2-CNOT gates
The paper discusses the asymptotic depth of a reversible circuit consisting of NOT, CNOT and 2-CNOT gates. Reversible circuit depth function $D(n, q)$ for a circuit implementing a transformation $f\colon \mathbb Z_2^n \to \mathbb Z_2^n$ is introduced as a function of $n$ and the number of additional inputs $q$. It is proved that for the case of implementing a permutation from $A(\mathbb Z_2^n)$...
متن کاملZ2Z4-linear codes: generator matrices and duality
A code ${\cal C}$ is $\Z_2\Z_4$-additive if the set of coordinates can be partitioned into two subsets $X$ and $Y$ such that the punctured code of ${\cal C}$ by deleting the coordinates outside $X$ (respectively, $Y$) is a binary linear code (respectively, a quaternary linear code). In this paper $\Z_2\Z_4$-additive codes are studied. Their corresponding binary images, via the Gray map, are $\Z...
متن کامل$(1-2u^k)$-constacyclic codes over $\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_+u^{3}\mathbb{F}_{p}+\dots+u^{k}\mathbb{F}_{p}$
Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^k)$-constacyclic codes over the ring $\mathcal{R}=\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p+u^{3}\mathbb{F}_{p}+\cdots+u^{k}\mathbb{F}_{p}$ where $u^{k+1}=u$. We illustrate the generator polynomials and investigate the structural properties of these codes via decomposition theorem.
متن کاملOn Codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$
In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and present construction of formally self-dual codes over $R$. Further, we give bounds on the minimum distance of LCD codes over $\F_q$ and extend these to codes ove...
متن کاملOne Cyclic Codes over $\mathbb{F}_{p^k} + v\mathbb{F}_{p^k} + v^2\mathbb{F}_{p^k} + ... + v^r\mathbb{F}_{p^k}$
In this paper, we investigate cyclic code over the ring Fpk + vFpk + v 2 Fpk + ...+ v r Fpk , where v = v, p a prime number, r > 1 and gcd(r, p) = 1, we prove as generalisation of [9] that these codes are principally generated, give generator polynomial and idempotent depending on idempotents over this ring as response to an open problem related in [11]. we also give a gray map and proprieties ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017